In this paper, I address the issue of the possible applicability of the ideas of Karl R. Popper’s social and political philosophy in the contemporary political life of postcolonial countries. Through reference to the reception of Popper’s philosophy in Central and Eastern Europe, I argue that Popper’s writings were effective in catalysing the political wholesale transformation by undermining Marxists’ pretensions to scientific status rather than through his anti-utopian and anti-revolutionary political recommendations. In the context of attempts to apply Popper’s ideas in postcolonial countries, especially Sub-Saharan Africa, I claim that the influence of Popper’s social thought on the politics of those countries may not be as effective as expected or desired.

The article aims to introduce the poem “Ghazavat” (غزوات), a work by the Safavid scholar and poet Mirza Abu Taleb Fendereski. Notably, the work is an Independent poem while all the sources in the Persian literary history have identified it as Takmale-ye Bazel-e Mashhadi’s Hamle-ye Heydari (تکمله حمله حیدری). The article explains reasons depicting that it is not a complementary work ((تکمله.

Undoubtedly, A Priori needs to be clarified if we are to understand the heart of Critique of Pure Reason; and Kant, precisely for this very reason, devoted a considerable part of Critique to explaining the epistemic status of A Priori, searching its origin, specifying its validity scope, and illustrating its instances. Although he, more or less, in both editions of Critique, put forward some characteristics intrinsic to A Priori (such as necessary, strictly universal, pure, clear, certain and Independent of Experience) since they have been also used in (pre)post-Kantian traditions, especially in a meaning different from what Kant meant, so they may simply bring about some confusions cause failing to appropriately grasp the heart of Critique. With reference to such confusions the authors make an attempt to shed light on this point in part (1). Then, in part (2-1), based on the text of Critique and its commentators’ views, authors proceed to show that to evade such confusions one should re-define necessary to “ what is emerged from the nature of the human mind” , strictly universal to “ applicable just in the realm of phenomenon” , pure to “ merely focused on the contribution of mind itself in collaboration with the objects themselves to form empirical knowledge” , clear to “ what the scope of searching for is limited to within ourselves not outside of it” and certain to “ what its scope is immutable – either regarding to its instances themselves or to their numbers” . In part (2-2), by scrutinizing the other characteristic (i. e. Independent of Experience), we shall show that this characteristic, besides of referring to mere structure, can refer to some kind of knowledge on which every possible Experience is based; moreover, we shall determine the relation of above characteristic to pre(post)-Kantian traditions.

A graphoidal cover of a graph (not necessarily finite) is a collection of paths (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of is an internal vertex of at most one path in , and (GC-2) every edge of is in exactly one path in . The pair is called a graphoidally covered graph and the paths in are called the -edges of . In a graphoidally covered graph , two distinct vertices and are -adjacent if they are the ends of an open -edge. A graphoidally covered graph in which no two distinct vertices are -adjacent is called -Independent and the graphoidal cover is called a totally disconnecting graphoidal cover of . Further, a graph possessing a totally disconnecting graphoidal cover is called a graphoidally Independent graph. The aim of this paper is to establish complete characterization of graphoidally Independent infinite cactus.

Let $G$ be a simple, undirected graph. In this paper, we initiate the study of Independent Roman $\{3\}$-domination. A function $g : V(G) \rightarrow \lbrace 0, 1, 2, 3 \rbrace$ having the property that $\sum_{v \in N_G(u)}^{} g(v) \geq 3$, if $g(u) = 0$, and $\sum_{v \in N_G(u)}^{} g(v) \geq 2$, if $g(u) = 1$ for any vertex $u \in V(G)$, where $N_G(u)$ is the set of vertices adjacent to $u$ in $G$, and no two vertices assigned positive values are adjacent is called an \textit{ Independent Roman $\{3\}$-dominating function} (IR3DF) of $G$. The weight of an IR3DF $g$ is the sum $g(V) = \sum_{v \in V}g(v)$. Given a graph $G$ and a positive integer $k$, the Independent Roman $\{3\}$-domination problem (IR3DP) is to check whether $G$ has an IR3DF of weight at most $k$. We investigate the complexity of IR3DP in bipartite and chordal graphs. The minimum Independent Roman $\lbrace 3 \rbrace$-domination problem (MIR3DP) is to find an IR3DF of minimum weight in the input graph. We show that MIR3DP is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs. We also show that the domination problem and IR3DP are not equivalent in computational complexity aspects. Finally, we present an integer linear programming formulation for MIR3DP.

An Independent Italian dominating function (IID-function) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2\}$ satisfying the conditions that (i) $\sum_{u\in N(v)}f(u)\geq2$ when $f(v)=0$, and (ii) the set of all vertices assigned non-zero values under $f$ is Independent. The weight of an IID-function is the sum of its function values over all vertices, and the Independent Italian domination number $i_{I}(G)$ of $G$ is the minimum weight of an IID-function on $G$. In this paper, we initiate the study of the Independent Italian bondage number $b_{iI}(G)$ of a graph $G$ having at least one component of order at least three, defined as the smallest size of a set of edges of $G$ whose removal from $G$ increases $i_{I}(G)$. We show that the decision problem associated with the Independent Italian bondage problem is NP-hard for arbitrary graphs. Moreover, various upper bounds on $b_{iI}(G)$ are established as well as exact values on it for some special graphs. In particular, for trees $T$ of order at least three, it is shown that $b_{iI}(T)\leq2$.

In this paper we initialize the study of Independent domination in directed graphs. We show that an Independent dominating set of an orientation of a graph is also an Independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, DAGs, cycles, and bipartite graphs. We also provide the idomatic number for special cases of some of these families of digraphs.

This paper studies the usefulness of Independent auditor's report from financial managers' point of view of the Iranian quoted companies in Tehran's stock exchange. The results of this study indicate that financial managers of the sampled firms view the Independent auditor's report as having an important role in discovering and reducing the possibilities of irregularities, frauds and in evaluating the basis of accounting estimates. Results also show that the role of the Independent auditor's report does not improve internal controls or help discovering and reducing errors and providing a basis for assessment of going concern concept.